Designing a screening experiment for highly reliable products

Within a reasonable life‐testing time, how to improve the reliability of highly reliable products is one of the great challenges to today's manufacturers. By using a resolution III experiment together with degradation test, Tseng, Hamada, and Chiao (1995) presented an interesting case study of improving the reliability of fluorescent lamps. However, in conducting such an experiment, they did not address the problem of how to choose the optimal settings of variables, such as sample size, inspection frequency, and termination time for each run, which are influential to the correct identification of significant factors and the experimental cost. Assuming that the product's degradation paths satisfy Wiener processes, this paper proposes a systematic approach to the aforementioned problem. First, an intuitively appealing identification rule is proposed. Next, under the constraints of a minimum probability of correct decision and a maximum probability of incorrect decision of the proposed identification rule, the optimum test plan (including the determinations of inspection frequency, sample size, and termination time for each run) can be obtained by minimizing the total experimental cost. An example is provided to illustrate the proposed method. © 2002 Wiley Periodicals, Inc. Naval Research Logistics 49: 514–526, 2002; Published online in Wiley InterScience (www.interscience.wiley.com). DOI 10.1002/nav.10024     

利用时间谱信息融合的空中目标分类算法

时间谱信息(目标的航迹、速度、机动性、空间坐标信息)揭示了目标空间状态随时间的变化特性,从而可利用目标的时谱简化(或缩小)待识别目标的范围。将低分辨雷达测量得到的高度、速度、加速度作为目标特征,建立典型空中目标对各特征的模糊隶属函数,进而采用改进的证据推理进行分类判决。结果表明利用时间谱信息可为雷达空中目标识别提供有效辅助手段。     

星载大容量固态存储控制器的级联编码设计

航天器大容量数据存储设备主要采用基于NAND Flash的固态存储器,但由于空间环境中单粒子翻转效应的影响,以及存储器芯片在操作过程中因为阈值电压偏移导致的位比特错误等原因,存储设备的可靠性降低。为提高数据存储设备的数据容错性,依据NAND Flash芯片物理结构和数据存储结构,具有针对性地提出RS(256,252)码+LDPC(8192,7154)码级联的纠检错并行编码设计,并优化编码算法的电路实现方法。建模仿真和地面测试系统测试结果表明:该设计具有低硬件开销、低功耗和高可靠性的优点。存储系统的数据总容量达512 Gb,有效数据吞吐率为700 Mb/s,能够满足航天器固态存储控制器对大容量数据控制和高数据吞吐量的设计需求。     

Modeling and solution for the ship stowage planning problem of coils in the steel industry

We consider a ship stowage planning problem where steel coils with known destination ports are to be loaded onto a ship. The coils are to be stowed on the ship in rows. Due to their heavy weight and cylindrical shape, coils can be stowed in at most two levels. Different from stowage problems in previous studies, in this problem there are no fixed positions on the ship for the coils due to their different sizes. At a destination port, if a coil to be unloaded is not at a top position, those blocking it need to be shuffled. In addition, the stability of ship has to be maintained after unloading at each destination port. The objective for the stowage planning problem is to minimize a combination of ship instability throughout the entire voyage, the shuffles needed for unloading at the destination ports, and the dispersion of coils to be unloaded at the same destination port. We formulate the problem as a novel mixed integer linear programming model. Several valid inequalities are derived to help reducing solution time. A tabu search (TS) algorithm is developed for the problem with the initial solution generated using a construction heuristic. To evaluate the proposed TS algorithm, numerical experiments are carried out on problem instances of three different scales by comparing it with a model‐based decomposition heuristic, the classic TS algorithm, the particle swarm optimization algorithm, and the manual method used in practice. The results show that for small problems, the proposed algorithm can generate optimal solutions. For medium and large practical problems, the proposed algorithm outperforms other methods. © 2015 Wiley Periodicals, Inc. Naval Research Logistics 62: 564–581, 2015     

A mathematical programming approach for improving the robustness of least sum of absolute deviations regression

This paper discusses a novel application of mathematical programming techniques to a regression problem. While least squares regression techniques have been used for a long time, it is known that their robustness properties are not desirable. Specifically, the estimators are known to be too sensitive to data contamination. In this paper we examine regressions based on Least‐sum of Absolute Deviations (LAD) and show that the robustness of the estimator can be improved significantly through a judicious choice of weights. The problem of finding optimum weights is formulated as a nonlinear mixed integer program, which is too difficult to solve exactly in general. We demonstrate that our problem is equivalent to a mathematical program with a single functional constraint resembling the knapsack problem and then solve it for a special case. We then generalize this solution to general regression designs. Furthermore, we provide an efficient algorithm to solve the general nonlinear, mixed integer programming problem when the number of predictors is small. We show the efficacy of the weighted LAD estimator using numerical examples. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2006     

基于信息需求的情报支持效能分析

经典的侦察与监测(S&R)系统效能分析方法存在模型难以建立、结果不准确等问题。考虑到S&R系统的目的是提供情报支持,提出一种基于信息需求的S&R系统情报支持效能分析方法。该方法以用户的信息需求为度量基准量,比较S&R系统性能对信息需求的满足度,并以此满足度作为S&R系统效能度量的指标。仿真实例表明了新方法的有用性。     

Balancing stability and efficiency in team formation as a generalized roommate problem

The assignment of personnel to teams is a fundamental managerial function typically involving several objectives and a variety of idiosyncratic practical constraints. Despite the prevalence of this task in practice, the process is seldom approached as an optimization problem over the reported preferences of all agents. This is due in part to the underlying computational complexity that occurs when intra-team interpersonal interactions are taken into consideration, and also due to game-theoretic considerations, when those taking part in the process are self-interested agents. Variants of this fundamental decision problem arise in a number of settings, including, for example, human resources and project management, military platooning, ride sharing, data clustering, and in assigning students to group projects. In this article, we study an analytical approach to “team formation” focused on the interplay between two of the most common objectives considered in the related literature: economic efficiency (i.e., the maximization of social welfare) and game-theoretic stability (e.g., finding a core solution when one exists). With a weighted objective across these two goals, the problem is modeled as a bi-level binary optimization problem, and transformed into a single-level, exponentially sized binary integer program. We then devise a branch-cut-and-price algorithm and demonstrate its efficacy through an extensive set of simulations, with favorable comparisons to other algorithms from the literature.     

超空泡航行体深度跟踪串级控制策略

针对空泡与航行体之间非线性滑行力导致的超空泡航行体稳定性问题,提出了基于圆判据理论和Nelder-Mead算法的超空泡航行体深度跟踪串级控制方法。介绍了超空泡航行体数学模型以及圆判据定理基础知识。结合模型特性推导了超空泡航行体串级误差状态方程,利用圆判据定理研究了内环绝对稳定性。通过Nelder-Mead算法对内环反馈参数进一步优化。仿真分析结果表明：所提控制方法便于反馈参数整定,可以充分利用超空泡航行体的控制量实现深度跟踪。     

基于改进整型遗传算法的稀疏矩形平面阵列优化

为了降低固定稀疏率、固定孔径的稀疏矩形阵列的峰值旁瓣电平,提出一种改进整型遗传算法。该算法在整型遗传算法的基础上,提出了等间隔采样的交叉策略、多点变异策略以及优良基因重组的策略。采取等间隔采样的基因交叉方式,可以有效发挥整型编码的优势,从而提高算法的运行效率;为了提高种群的多样性,防止算法陷入局部最优,采用了多点变异策略;采用优良基因重组技术,加快了算法的收敛速度。仿真结果表明,相比传统的二进制和实数编码,整型编码更为直接高效;与用于稀疏矩形阵列优化的相关算法相比,本文所提算法获得了更优的旁瓣电平,证实了算法的有效性和优越性。     

放大转发双向中继网络的移动级联信道统计特征分析

针对放大转发协议下双向中继网络移动级联信道,为了分析其统计特征,结合用户完成信息交互的过程,将移动级联信道分解为传输部分和干扰部分两个时间过程。依据它们的双高斯乘积特点,分别给出了对应的一阶概率密度分布、二阶自相关函数和多普勒功率谱的表达式。与此同时,通过采用Gamma分布对级联信道进行了概率近似,得到了描述移动级联信道时变特性的电平通过率和平均衰落时间等指标的近似计算式。借助数值仿真验证了上述表达式的正确性。